Term Rewriting Systems : Syntax , Semantics , and Pragmatics Extended
نویسندگان
چکیده
We present a formalism called Addressed Term Rewriting Systems, which can be used to define the operational semantics of programming languages, especially those involving sharing, recursive computations and cyclic data structures. Addressed Term Rewriting Systems are therefore well suited for describing object-based languages, as for instance the family of languages called λObja, involving both functional and object-based features.
منابع مشابه
Categorical term rewriting : monads and modularity
Term rewriting systems are widely used throughout computer science as they provide an abstract model of computation while retaining a comparatively simple syntax and semantics. In order to reason within large term rewriting systems, structuring operations are used to build large term rewriting systems from smaller ones. Of particular interest is whether key properties are modular, that is, if t...
متن کاملAutomated Reasoning I∗
Preliminaries abstract reduction systems well-founded orderings Propositional logic syntax, semantics calculi: DPLL-procedure, . . . implementation: 2-watched literals, clause learning First-order predicate logic syntax, semantics, model theory, . . . calculi: resolution, tableaux, . . . implementation: sharing, indexing First-order predicate logic with equality term rewriting systems calculi: ...
متن کاملRewriting the Conditions in Conditional Rewriting
Category theory has been used to provide a semantics for term rewriting systems at an intermediate level of abstraction between the actual syntax and the relational model. Recently we have developed a semantics for TRSs using monads which generalises the equivalnece between algebraic theories and nitary monads on the category Sets. This semantics underpins the recent categorical proofs of state...
متن کاملUniqueness Typing for Functional Languages with Graph Rewriting Semantics
We present two type systems for term graph rewriting: conventional typing and (polymorphic) uniqueness typing. The latter is introduced as a natural extension of simple algebraic and higher-order uniqueness typing. The systems are given in natural deduction style using an inductive syntax of graph denotations with familiar constructs such as let and case. The conventional system resembles tradi...
متن کاملInteraction Nets and Term Rewriting Systems (Extended Abstract)
Term rewriting systems provide a framework in which it is possible to specify and program in a one-dimensional syntax. Interaction nets, on the other hand, provide a graphical syntax for the same purpose. In this paper, our aim is to bridge the gap between the above formalisms by showing how to understand interaction nets in a term rewriting framework. This allows us to transfer results from on...
متن کامل